Reflexive semigroups

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Note on Coradical of Consistent Subset of Σ-reflexive Semigroups with Apartness

The concept of σ-reflexive semigroups is due to Chacron and Thierrin in 1972. In the present paper we discuss σ-reflexive semigroups with apartness. We prove some fundamental properties of these semigroups.

متن کامل

‎Finite iterative methods for solving systems of linear matrix equations over reflexive and anti-reflexive matrices

A matrix $Pintextmd{C}^{ntimes n}$ is called a generalized reflection matrix if $P^{H}=P$ and $P^{2}=I$‎. ‎An $ntimes n$‎ ‎complex matrix $A$ is said to be a reflexive (anti-reflexive) matrix with respect to the generalized reflection matrix $P$ if $A=PAP$ ($A=-PAP$)‎. ‎In this paper‎, ‎we introduce two iterative methods for solving the pair of matrix equations $AXB=C$ and $DXE=F$ over reflexiv...

متن کامل

Reflexive Interactions

Reflexive methodology was used to identify music collectors’ needs, that informed the development of conceptual prototypes which create moments of delightful distraction in their everyday lives. ARON: music lives in the cloud is a music listening and sharing system that enables ambient, non-task oriented experiences through networked biomorphic light forms equipped with a presence interface. AR...

متن کامل

Reflexive Interpreters

The goal of achieving powerful problem solving capabilities leads to the “advice taker” form of program and the associated problem of control. This proposal outlines an approach to this problem based on the construction of problem solvers with advanced self-knowledge and introspection capabilities. 1 The Problem of Control Self-reverence, self-knowledge, self-control, These three alone lead lif...

متن کامل

Automatic semigroups vs automaton semigroups

We develop an effective and natural approach to interpret any semigroup admitting a special language of greedy normal forms as an automaton semigroup, namely the semigroup generated by a Mealy automaton encoding the behaviour of such a language of greedy normal forms under one-sided multiplication. The framework embraces many of the well-known classes of (automatic) semigroups: free semigroups,...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Proceedings of the American Mathematical Society

سال: 1965

ISSN: 0002-9939

DOI: 10.1090/s0002-9939-1965-0182665-4